Type-insensitive ODE codes based on implicit $A(\alpha )$-stable formulas

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Type - Insensitive ODE Codes Based on Implicit A ( a ) - Stable Formulas

Previous work on A -stable formulas is extended to A (a (-stable formulas, which are far more important in practice. Some important improvements in technique based on another interation method and an idea of Enright for the efficient handling of Jacobians are proposed. Implementation details and numerical examples are provided for a research-grade code.

متن کامل

Adaptive nested implicit Runge–Kutta formulas of Gauss type

This paper deals with a special family of implicit Runge–Kutta formulas of orders 2, 4 and 6. These methods are of Gauss type; i.e., they are based on Gauss quadrature formulas of orders 2, 4 and 6, respectively. However, the methods under discussion have only explicit internal stages that lead to cheap practical implementation. Some of the stage values calculated in a step of the numerical int...

متن کامل

Mollification formulas and implicit smoothing

This paper develops some mollification formulas involving convolutions between popular radial basis function (RBF) basic functions Φ, and suitable mollifiers. Polyharmonic splines, scaled Bessel kernels (Matern functions) and compactly supported basic functions are considered. A typical result is that in Rd the convolution of | • |β and (•2 + c2)−(β+2d)/2 is the generalized multiquadric (•2 + c...

متن کامل

Numerically Stable Real Number Codes Based on Random Matrices

Error correction codes defined over realnumber and complex-number fields have been studied and recognized as useful in many applications. However, most real-number and complex-number codes in literature are quite suspect in their numerical stability. In this paper, we introduce a class of numerically stable real-number and complex-number codes that are based on random generator matrices over re...

متن کامل

On Auslander-Buchsbaum - type formulas

We give a short and simple argument that proves, in a uniform way, the Auslander-Buchsbaum formula, relating depth and projective dimension, and the Auslander-Bridger formula, relating depth and G-dimension. Moreover, the same type of argument quickly reproves the fact that, in the degrees above the codepth, the syzygy modules of a finite module over a commutative local ring have no free summan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1982

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1982-0658216-2